Packing Two Disks into a Polygonal Environment
نویسندگان
چکیده
Prosenjit Bose1, Pat Morin2, and Antoine Vigneron3 1 Carleton University. [email protected] 2 McGill University. [email protected] 3 Hong Kong University of Science and Technology. [email protected] Abstract. We consider the following problem. Given a polygon P , possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are contained in P , and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on worst case input, is O(n log n). This is optimal in the algebraic decision tree model of computation.
منابع مشابه
Data allocation on disks with solution reconfiguration (problems, heuristics)
The paper addresses problem of data allocation in two-layer computer storage while taking into account dynamic digraph(s) over computing tasks. The basic version of data file allocation on parallel hard magnetic disks is considered as special bin packing model. Two problems of the allocation solution recon-figuration (restructuring) are suggested: (i) one-stage restructuring model, (ii) multist...
متن کاملPii: S0925-7721(01)00044-x
We present two algorithms for packing two largest disks in a polygon. The first algorithm locates two disks in a simple polygon in time O(n log2 n) improving the best previous deterministic result (Bespamyatnikh, 1999) by a factor of logn. The second algorithm finds two disks in a convex polygon such that the disks are separated by a diagonal of the polygon. It runs in time O(n log2 n) improvin...
متن کاملParticles Size Distribution Effect on 3d Packing of Nanoparticles Into a Bounded Region
In this paper, the effects of two different Particle Size Distributions (PSD) on packingbehavior of ideal rigid spherical nanoparticles using a novel packing model based on parallelalgorithms have been reported. A mersenne twister algorithm was used to generate pseudorandomnumbers for the particles initial coordinates. Also, for this purpose a nanosized tetragonal confinedcontainer with a squar...
متن کاملPacking Segments in a Convex 3-Polytope is NP-hard
We show it is NP-hard to pack the maximum number of segments in a convex 3-dimensional polytope. We show this packing problem is also NP-hard for general polygonal regions in the plane. This problem relates two streams of research, Kakeya set problems and packing problems.
متن کاملRandom close packing revisited: ways to pack frictionless disks.
We create collectively jammed (CJ) packings of 50-50 bidisperse mixtures of smooth disks in two dimensions (2D) using an algorithm in which we successively compress or expand soft particles and minimize the total energy at each step until the particles are just at contact. We focus on small systems in 2D and thus are able to find nearly all of the collectively jammed states at each system size....
متن کامل